Local search for satisfiability (SAT) problem
نویسنده
چکیده
The satissability problem (SAT) is a fundamental problem in mathematical logic, constraint satisfaction , VLSI engineering, and computing theory. Methods to solve the satissability problem play an important role in the development of computing theory and systems. Traditional methods treat the SAT problem as a constrained decision problem. During past research, the number of unsatissable clauses as the value of an objective function was formulated. This transforms the SAT problem into a search problem | an unconstrained optimization problem to the objective function. A variety of iterative optimization techniques can be used to solve this optimization problem. In this paper, we show how to use local search techniques to solve the SAT problem. The average time complexity analysis and numerous real algorithm executions were performed. They indicate that the local search algorithms are much more eecient than the existing SAT algorithms for certain classes of conjunctive normal form (CNF) formulas.
منابع مشابه
Backbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...
متن کاملProc. IJCAI-03, to appear. Backbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...
متن کاملA Probability Distribution Strategy with Efficient Clause Selection for Hard Max-SAT Formulas
Many real-world problems involving constraints can be regarded as instances of the Max-SAT problem, which is the optimization variant of the classic satisfiability problem. In this paper, we propose a novel probabilistic approach for Max-SAT called ProMS. Our algorithm relies on a stochastic local search strategy using a novel probability distribution function with two strategies for picking va...
متن کاملWeight Redistribution for Unweighted MAX-SAT
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT problem an important area of research for the satisfiability (SAT) community. In this study we perform an empirical analysis of several of the best performing SAT local search techniques in the domain of unweighted MAX-SAT...
متن کاملAn Evolutionary Local Search Method for Incremental Satisfiability
Incremental satisfiability problem (ISAT) is considered as a generalisation of the Boolean satisfiability problem (SAT). It involves checking whether satisfiability is maintained when new clauses are added to an initial satisfiable set of clauses. Since stochastic local search algorithms have been proved highly efficient for SAT, it is valuable to investigate their application to solve ISAT. Ex...
متن کاملIterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in AI and other areas of computing science. In this paper, we present a new stochastic local search (SLS) algorithm for MAXSAT that combines Iterated Local Search and Tabu Search, two well-known SLS methods that have been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Systems, Man, and Cybernetics
دوره 23 شماره
صفحات -
تاریخ انتشار 1993